Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
161	The Structure of Information Pathways in a Social Communication Network Gueorgi Kossinets Dept. of Sociology Cornell University Ithaca, NY 14853 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2008-06-17 16:02:39 Network theory Networks Network flow Flow network Operations research Shortest path problem Network topology Internet backbone Connectivity Graph theory Mathematics Theoretical computer science
162	A Transportation Network Efficiency Measure that Captures Flows, Behavior, and Costs with Applications to Network Component Importance Identification and Vulnerability Anna Nagurney and Qiang Qiang Isenberg School of Man Add to Reading List Source URL: supernet.isenberg.umass.edu Language: English - Date: 2007-04-11 06:27:40 Theoretical computer science Networks Network flow Cybernetics Network science Flow network Shortest path problem Network topology Anna Nagurney Graph theory Network theory Mathematics
163	A Unified Network Performance Measure with Importance Identification and the Ranking of Network Components Qiang Qiang and Anna Nagurney∗ Department of Finance and Operations Management Isenberg School of Management Add to Reading List Source URL: supernet.isenberg.umass.edu Language: English - Date: 2008-01-20 11:44:35 Theoretical computer science Networks Network flow Cybernetics Network science Flow network Shortest path problem Network topology Graph theory Network theory Mathematics
164	Chapter 1 Supernetworks Anna Nagurney Department of Finance & Operations Management Isenberg School of Management Add to Reading List Source URL: supernet.isenberg.umass.edu Language: English - Date: 2005-01-09 08:54:52 Theoretical computer science Network theory Network topology Computer network Shortest path problem Telecommunications network Flow network Telecommunication Route assignment Graph theory Telecommunications engineering Mathematics
165	Lecture 5 The System-Optimized (S-O) Problem Dr. Anna Nagurney John F. Smith Memorial Professor and Director – Virtual Center for Supernetworks Add to Reading List Source URL: supernet.isenberg.umass.edu Language: English - Date: 2011-08-24 10:25:36 Technology Anna Nagurney Mathematical optimization Logistics Supply chain AMPL Flow network Operations research Business Science
166	Lecture 4 The User-Optimized (U-O) Problem Professor Anna Nagurney John F. Smith Memorial Professor and Director – Virtual Center for Supernetworks Add to Reading List Source URL: supernet.isenberg.umass.edu Language: English - Date: 2011-08-23 15:49:44 Operations research Mathematics Anna Nagurney Year of birth missing Route assignment Logistics Flow network Routing Science Network flow Game theory Transportation planning
167	Computer Networks[removed]–284 www.elsevier.com/locate/comnet Conﬁguring sessions in programmable networks Sumi Choi a Add to Reading List Source URL: www.ecs.umass.edu Language: English - Date: 2013-12-04 11:29:25 Network theory Routing algorithms Network flow Shortest path tree Shortest path problem Path Graph Flow network Routing Graph theory Mathematics Theoretical computer science
168	Virtual Network Mapping with Traffic Matrices Cong Wang, Shashank Shanbhag and Tilman Wolf Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA, USA {cwang,sshanbha,wolf}@ecs.umass.e Add to Reading List Source URL: www.ecs.umass.edu Language: English - Date: 2013-12-04 11:29:29 Network flow Network theory Network topology Topology Computer network Flow network Node Virtual circuit Shortest path problem Graph theory Electronics Mathematics
169	OIM 413 Logistics and Transportation Lecture 4: The User-Optimized (U-O) Problem Professor Anna Nagurney John F. Smith Memorial Professor and Director – Virtual Center for Supernetworks Add to Reading List Source URL: supernet.isenberg.umass.edu Language: English - Date: 2013-09-01 12:52:58 Operations research Mathematics Anna Nagurney Year of birth missing Route assignment Logistics Flow network Routing Nash equilibrium Network flow Game theory Transportation planning
170	THE UNIVERSITY OF MANITOBA DATE Algorithms Candidacy Examination Enter NAME and STUDENT NUMBER: Add to Reading List Source URL: umanitoba.ca Language: English - Date: 2014-09-12 13:55:19 Network flow Asymptotic analysis Integer sequences Combinatorics Time complexity Randomized algorithm Ford–Fulkerson algorithm Maximum flow problem Algorithm Mathematics Theoretical computer science Analysis of algorithms

UPDATE